Computational Complexity in Constraint-based Combinatorial Auctions
نویسندگان
چکیده
Abstract: This paper analyzes the dynamic programming construction of bundles within the framework of the Winner Determination Problem in Combinatorial Auctions, based on constraint processing. We discuss different approaches to its representation and highlight the corresponding complexity, employing suitable combinatorics from Discrete Mathematics. Our view may enlighten us about the exponential search space—and incidentally pointing to appropriate techniques to cope with this challenge.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Comparative Study of Two Combinatorial Reverse Auction Models
Online group-buying is one of the most innovative business models employed by many companies. From the perspective of buyers, quantity based discounts provide a huge incentive to form coalitions and take advantage of lower prices without ordering more than their actual demand. Traditional group-buying mechanisms are usually based on a single item and uniform cost sharing. One way to reduce the ...
متن کاملAn Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
This paper presents an approximate algorithm for the winner determination problem in combinatorial auctions, which is based on limited discrepancy search (LDS). Internet auctions have become an integral part of Electronic Commerce and can incorporate largescale, complicated types of auctions including combinatorial auctions, where multiple items are sold simultaneously and bidders can express c...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملIncentives and Computation: Combinatorial Auctions and Networks
This work studies centralized and decentralized protocol design in various computational environments. More specifically, we address the interplay between incentives and computational issues: we first describe positive results for restricted agents, we then show that the incentive constraint essentially implies computational hardness. Finally, we observe that in computerized networks the standa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008